Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems
نویسندگان
چکیده
منابع مشابه
Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems
In this paper, we describe a new mechanism of cellular selection as an improved Genetic Algorithm for some optimization problems like Cellular Channel assignment, which have multi feasible/optimum solution per one case. Considering the problems and the nature of relationship among individuals in population, we use 2-dimension Cellular Automata in order to place the individuals onto its cells to...
متن کاملA New Genetic based Algorithm for Channel Assignment Problems
In the channel assignment problem, frequencies are assigned to the requested calls in a cellular mobile network subject to electromagnetic compatibility constraints such that a required bandwidth is minimized. In this paper, a new method based on genetic algorithm is proposed to solve these problems. The performance of the proposed method is evaluated by solving 3 channel assignment problems. R...
متن کاملA Similarity-based Cellular Selection Mechanisim for Genetic algorithms to Solve Assignment Problems
In this paper, we illustrate a cellular structure mixed with Genetic Algorithms for solving assignment problems which have more than one feasible or optimum solution. Considering similarity among individuals in population, we use two dimensions Cellular Automata in order to place the individuals onto its cells to make the locality and neighborhood on Hamming distance basis. This new structure a...
متن کاملgenetic algorithm based on explicit memory for solving dynamic problems
nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memo...
متن کاملA Modified Genetic Algorithm for the Generalized Assignment Problems
In this paper, a specialized Genetic Algorithm is proposed and applied for the solution of the Generalized Assignment Problem. Special crossover and the mutation operators called Common Element Crossover (CEX) and In-Pool Mutation (IPM) respectively has been defined by focusing on the special needs and nature of the Generalized Assignment Problem. The performance of the proposed method has been...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Intelligent Systems
سال: 2012
ISSN: 2165-8978
DOI: 10.5923/j.ajis.20110101.05